Efficient algorithm for obtaining connected components in bi-level images
نویسندگان
چکیده
We propose an efficient method for labeling connected components in bi-level images. The proposed algorithm uses a Deterministic Finite Automaton to obtain chain codes and label component boundaries, and use a tracing technique that is simpler than existing methods. Experiments on various types of images show that the proposed method improves contour tracing efficiency.
منابع مشابه
A Hybrid Fire Fly and Differential Evolution Algorithm for Optimization of a Mixed Repairable and Non-Repairable System Reliability Problem
In this paper, a hybrid meta-heuristic approach is proposed to optimize the mathematical model of a system with mixed repairable and non-repairable components. In this system, repairable and non-repairable components are connected in series. Redundant components and preventive maintenance strategies are applied for non-repairable and repairable components, respectively. The problem is formulate...
متن کاملA Bi-Level Meta-heuristic Approach for a Hazardous Waste Management Problem
This study concentrates on designing a medical waste management system with a hierarchical structure, including a local government and a waste management planner. The upper-level seeks to design and control the waste management facilities by minimizing the environmental risks related to the disposal of medical waste. While the lower-level model is to determine the waste collection plans by only...
متن کاملA Non-linear Integer Bi-level Programming Model for Competitive Facility Location of Distribution Centers
The facility location problem is a strategic decision-making for a supply chain, which determines the profitability and sustainability of its components. This paper deals with a scenario where two supply chains, consisting of a producer, a number of distribution centers and several retailers provided with similar products, compete to maintain their market shares by opening new distribution cent...
متن کاملA Multi-Objective Particle Swarm Optimization Algorithm for a Possibilistic Open Shop Problem to Minimize Weighted Mean Tardiness and Weighted Mean Completion Times
We consider an open shop scheduling problem. At first, a bi-objective possibilistic mixed-integer programming formulation is developed. The inherent uncertainty in processing times and due dates as fuzzy parameters, machine-dependent setup times and removal times are the special features of this model. The considered bi-objectives are to minimize the weighted mean tardiness and weighted mean co...
متن کاملPresentation and Solving Non-Linear Quad-Level Programming Problem Utilizing a Heuristic Approach Based on Taylor Theorem
The multi-level programming problems are attractive for many researchers because of their application in several areas such as economic, traffic, finance, management, transportation, information technology, engineering and so on. It has been proven that even the general bi-level programming problem is an NP-hard problem, so the multi-level problems are practical and complicated problems therefo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEICE Electronic Express
دوره 11 شماره
صفحات -
تاریخ انتشار 2014